Improved LT Codes in Low Overhead Regions for Binary Erasure Channels
نویسندگان
چکیده
We study improved degree distribution for Luby Transform (LT) codes which exhibits improved bit error rate performance particularly in low overhead regions. We construct the degree distribution by modifying Robust Soliton distribution. The performance of our proposed LT codes is evaluated and compared to the conventional LT codes via And-Or tree analysis. Then we propose a transmission scheme based on the proposed degree distribution to improve its frame error rate in full recovery regions. Furthermore, the improved degree distribution is applied to distributed multi-source relay networks and unequal error protection. It is shown that our schemes achieve better performance and reduced complexity especially in low overhead regions, compared with conventional schemes. Copyright c © 2013 John Wiley & Sons, Ltd.
منابع مشابه
Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels
We present Kovalenko’s full-rank limit as a tight lower bound for decoding error probability of LDPC codes and LT codes over BEC. From the limit, we derive a full-rank overhead as a lower bound for stable overheads for successful maximum-likelihood decoding of the codes.
متن کاملLuby Transform Codes with Priority Encoding
Rateless codes over a binary erasure channel (BEC) provide successful transmission independent of the erasure probability. Luby Transform (LT) codes and raptor codes are examples of rateless codes over a BEC. For successful decoding, LT codes require either a large overhead at linear complexity, or capacity-approaching overheads with nonlinear complexity. When overhead is low at linear complexi...
متن کاملRegularized Variable-Node LT Codes with Improved Erasure Floor Performance
We consider the use of extrinsic information transfer charts for the design of Luby Transform (LT) codes over the binary erasure channel (BEC). In particular, we formulate an optimization problem to determine asymptotically good checknode degree distributions in terms of decoder overhead. We further propose a modified encoding scheme that maximizes the minimum variable-node degree, thus optimiz...
متن کاملPerformance Analysis and Improvement of LT Codes over AWGN Channels
LT codes, the first universal erasure-correcting codes, have near-optimal performance over binary erasure channels for any erasure probability, but exhibit high bit error rate and error floor over the noisy channels. This paper investigated the performance of LT codes over the additive white Gaussian noise channels. We designed the systematic LT codes through reconstructing the bipartite graph ...
متن کاملImproving the Left Degree Distribution of Fountain Codes in the Finite-Length Regime
Fountain codes were introduced to provide higher reliability, lower complexities, and more scalability for networks such as the Internet. In this thesis, we study LubyTransform (LT) codes which are the first realization of Fountain codes. In the LT codes, a sparse random factor graph is dynamically generated on both the encoder and decoder sides of the communications channel. The graph is gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1309.3195 شماره
صفحات -
تاریخ انتشار 2013